Some extremal problems of graphs with local constraints

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some extremal problems of graphs with local constraints

Let P be a family of graphs. A graph G is said to satisfy a property P locally if G[N (v)]∈P for every v∈V (G). The class of graphs that satis6es the property P locally will be denoted by L(P) and we shall call such a class a local property. Let P be a hereditary property. A graph is said to be maximal with respect to a hereditary property P (shortly P-maximal) if it belongs to P and none of it...

متن کامل

SOME EXTREMAL PROBLEMS ON r-GRAPHS

1 . Introduction . By an r-graph we mean a fixed set of vertices together with a class of unordered subsets of this fixed set, each subset containing exactly r elements and called an r-tuple . In the language of Berge [2j this is a simple uniform hypergraph of rank r . The concept becomes interesting only for r > 1 : for r = 2 we obtain ordinary (i .e ., Michigan) graphs . We shall represent an...

متن کامل

Extremal graphs in some coloring problems

For a simple graph G with chromatic number x(G), the Nordhaus-Gaddum inequalities give upper and lower bounds for z(G)•(G ¢) and z(G)+ x(GC). Based on a characterization by Fink of the extremal graphs G attaining the lower bounds for the product and sum, we characterize the extremal graphs G for which A(G)B(G c) is minimum, where A and B are each of chromatic number, achromatic number and pseud...

متن کامل

Some Extremal Problems for Edge-Regular Graphs

We consider the class ER(n, d, λ) of edge-regular graphs for some n > d > λ, i.e., graphs regular of degree d on n vertices, with each pair of adjacent vertices having λ common neighbors. It has previously been shown that for such graphs with λ > 0 we have n ≥ 3(d − λ) and much has been done to characterize such graphs when equality holds. Here we show that n ≥ 3(d − λ) + 1 if λ > 0 and d is od...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2002

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(01)00324-7